A New Recursive Decomposition Algorithm for Realizing Fast IMDCT Computation
نویسندگان
چکیده
In this paper, a new decomposition algorithm for realizing fast inverse modified discrete cosine transform (IMDCT) computation is presented. The decomposition algorithm can convert a pair of long transforms into 2 pairs of short transforms with half size of the long transforms. In addition, the decomposition algorithm can be utilized recursively to attain shorter transforms and reduce computational cycles. Based on the previous experimental results, the number of computational cycles of 512-point IMDCT is estimated to be 9641, which is less than those in previous reports. Key-Words: inverse modified discrete cosine transform (IMDCT); DCT-IV; DST-IV; decomposition algorithm; TDAC; analysis/synthesis filter banks
منابع مشابه
Fast and Efficient Computation of MDCT/IMDCT Algorithms for MP3 Applications
The modified discrete cosine transforms (MDCT) and its inverse (IMDCT) has become important for audio codec. MDCT/IMDCT algorithms are widely applied to realize the analysis/synthesis filter banks of the time-domain aliasing cancellation scheme for sub band coding in various audio standards. The inverse modified discrete cosine transform (IMDCT) is the most computational intensive operations in...
متن کاملA fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT and IMDCT with block size M×N into four 2-D discrete cosine transforms (DCTs) with block size (M/4)×(N/4). It is based on an algorithm recently presented by Cho [7] for the efficient calculation of one-dimensional MDCT ...
متن کاملMixed-radix Algorithm for the Computation of Forward and Inverse MDCT
The modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) are two of the most computational intensive operations in MPEG audio coding standards. A new mixed-radix algorithm for efficient computing the MDCT/IMDCT is presented. The proposed mixed-radix MDCT algorithm is composed of two recursive algorithms. The first algorithm, called the radix-2 decimation in frequency (DIF) algorit...
متن کاملFast IMDCT and MDCT algorithms - a matrix approach
This paper presents a systematic investigation of the modified discrete cosine transform/inverse modified discrete cosine transform (MDCT/IMDCT) algorithm using a matrix representation. This approach results in new understanding of the MDCT/IMDCT, enables the development of new algorithms, and makes clear the connection between the algorithms. We represent in a matrix form the IMDCT as the prod...
متن کاملHIERARCHICAL COMPUTATION OF HERMITE SPHERICAL INTERPOLANT
In this paper, we propose to extend the hierarchical bivariateHermite Interpolant to the spherical case. Let $T$ be an arbitraryspherical triangle of the unit sphere $S$ and let $u$ be a functiondefined over the triangle $T$. For $kin mathbb{N}$, we consider aHermite spherical Interpolant problem $H_k$ defined by some datascheme $mathcal{D}_k(u)$ and which admits a unique solution $p_k$in the ...
متن کامل